Infinitely log-monotonic combinatorial sequences
نویسندگان
چکیده
منابع مشابه
Log-balanced combinatorial sequences
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log-balancedness are given for the case when the sequence satisfies a two(or more-) term linear recurrence. It is shown that many combinatorially interesti...
متن کاملOn the log-convexity of combinatorial sequences
Here presented is a survey for the log-convexity of some famous combinatorial sequences. We develop techniques for dealing with the log-convexity of sequences satisfying a three-term recurrence. We also introduce the concept of q-log-convexity and establish the link with linear transformations preserving the log-convexity. MSC: 05A20; 11B73; 11B83; 11B37
متن کاملLog-infinitely divisible multifractal processes
We define a large class of multifractal random measures and processes with arbitrary loginfinitely divisible exact or asymptotic scaling law. These processes generalize within a unified framework both the recently defined log-normal Multifractal Random Walk processes (MRW) [33, 3] and the log-Poisson “product of cynlindrical pulses” [7]. Their construction involves some “continuous stochastic m...
متن کاملLog–convexity of Combinatorial Sequences from Their Convexity
A sequence (xn)n 0 of positive real numbers is log-convex if the inequality xn xn−1xn+1 is valid for all n 1 . We show here how the problem of establishing the log-convexity of a given combinatorial sequence can be reduced to examining the ordinary convexity of related sequences. The new method is then used to prove that the sequence of Motzkin numbers is log-convex.
متن کاملA Criterion for the Log-Convexity of Combinatorial Sequences
Recently, Došlić, and Liu and Wang developed techniques for dealing with the log-convexity of sequences. In this paper, we present a criterion for the log-convexity of some combinatorial sequences. In order to prove the log-convexity of a sequence satisfying a three-term recurrence, by our method, it suffices to compute a constant number of terms at the beginning of the sequence. For example, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2014
ISSN: 0196-8858
DOI: 10.1016/j.aam.2013.08.003